A Proposal of a Genetic Algorithm for Uncapacitated Facility Location Problem
نویسندگان
چکیده
منابع مشابه
A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
We present a 1.488 approximation algorithm for the metric uncapacitated facility location (UFL) problem. The previous best algorithm was due to Byrka [1]. By linearly combining two algorithms A1(γf ) for γf = 1.6774 and the (1.11,1.78)-approximation algorithm A2 proposed by Jain, Mahdian and Saberi [8], Byrka gave a 1.5 approximation algorithm for the UFL problem. We show that if γf is randomly...
متن کاملAn 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem
The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑
متن کاملMemetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem
We consider the Multilevel Uncapacitated Facility Location Problem (MLUFLP) and propose a new efficient integer programming formulation of the problem that provides optimal solutions for theMLUFLP test instances unsolved to optimality up to now. Further, we design a parallel Memetic Algorithm (MA) with a new strategy for applying the local search improvement within the MA frame. The conducted c...
متن کاملAn incremental algorithm for the uncapacitated facility location problem
We study the incremental facility location problem, wherein we are given an instance of the uncapacitated facility location problem and seek an incremental sequence of opening facilities and an incremental sequence of serving customers along with their fixed assignments to facilities open in the partial sequence. We say that a sequence has a competitive ratio of k, if the cost of serving the fi...
متن کاملA hybrid multistart heuristic for the uncapacitated facility location problem
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show extensive empirical evidence to the effectiveness of our algorithm in practice. For most benchmarks instances in the literature, we obtain solutions that are either optimal or a fraction of a percentage point away from it....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2008
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.128.628